Improved algorithms for feedback vertex set problems
نویسندگان
چکیده
منابع مشابه
Improved Algorithms for the Feedback Vertex Set Problems
We present improved parameterized algorithms for the Feedback Vertex Set problem on both unweighted and weighted graphs. Both algorithms run in time O(5kn). The algorithms construct a feedback vertex set of size bounded by k (in the weighted case this set is of minimum weight among the feedback vertex set of size at most k) in a given graph G, or reports that no such a feedback vertex set exist...
متن کامل0333 - 3590 Improved Algorithms for the Feedback Vertex Set Problems
We present improved parameterized algorithms for the Feedback Vertex Set problem on both unweighted and weighted graphs. Both algorithms run in time O(5kn). For unweighted graphs, our algorithm either constructs a feedback vertex set of size bounded by k in a given graph G, or reports that no such a feedback vertex set exists in G. For weighted graphs, our algorithm either constructs a minimum-...
متن کاملImproved Algorithms and Combinatorial Bounds for Independent Feedback Vertex Set
In this paper we study the “independent” version of the classic Feedback Vertex Set problem in the realm of parameterized algorithms and moderately exponential time algorithms. More precisely, we study the Independent Feedback Vertex Set problem, where we are given an undirected graph G on n vertices and a positive integer k, and the objective is to check if there is an independent feedback ver...
متن کاملParameterized Algorithms for Feedback Vertex Set
We present an algorithm for the parameterized feedback vertex set problem that runs in time O((2 lg k + 2 lg lg k + 18)n). This improves the previous O(max{12, (4 lg k)}n) algorithm by Raman et al. by roughly a 2 factor (n ∈ O(n) is the time needed to multiply two n × n matrices). Our results are obtained by developing new combinatorial tools and employing results from extremal graph theory. We...
متن کاملFPT Algorithms for Connected Feedback Vertex Set
We study the recently introduced Connected Feedback Vertex Set (CFVS) problem from the view-point of parameterized algorithms. CFVS is the connected variant of the classical Feedback Vertex Set problem and is defined as follows: given a graph G = (V, E) and an integer k, decide whether there exists F ⊆ V , |F | ≤ k, such that G[V \ F ] is a forest and G[F ] is connected. We show that Connected ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 2008
ISSN: 0022-0000
DOI: 10.1016/j.jcss.2008.05.002